Collision Resistance of the JH Hash Function

The Hash Function JH

Breaking the Even-Mansour Hash Function: Collision and Preimage Attacks on JH and Grøstl

The Even-Mansour structure and the chopMD mode are two widely-used strategies in hash function designs. They are adopted by many hash functions including two SHA-3 finalists, the JH hash function and the Grøstl hash function. The Even-Mansour structure combining the chopMD mode is supposed to enhance the security of hash functions against collision and preimage attacks, while our results show t...

Security Analysis of the Mode of JH Hash Function

Recently, NIST has selected 14 second round candidates of SHA3 competition. One of these candidates will win the competition and eventually become the new hash function standard. In TCC’04, Maurer et al introduced the notion of indifferentiability as a generalization of the concept of the indistinguishability of two systems. Indifferentiability is the appropriate notion of modeling a random ora...

A New and Collision-resistance Hash Function DIHA2

The new hash function DIHA2 (Dynamic Input Hash Algorithm)is with the structure of Merkle-Damgard and is based on 64-bit computing.It operates each 1024-bit block and outputts a 256-bit hash-value. For a 64-bit sub-block X[j](0 ≤ j ≤ 15) of each step, DIHA2 gets a dynamic mapping value of TLU (table look up,The table was 256-Byte only)and add it to operation of variables a, b, c, d,so as to eli...

Collision Attack on the Waterfall Hash Function

We give a method that appears to be able to find colliding messages for the Waterfall hash function with approximately O(2) work for all hash sizes. If correct, this would show that the Waterfall hash function does not meet the required collision resistance.